Enhancing scalability of sparse direct methods
نویسندگان
چکیده
منابع مشابه
Enhancing Scalability of Sparse Direct Methods
TOPS is providing high-performance, scalable sparse direct solvers, which have had significant impacts on the SciDAC applications, including fusion simulation (CEMM), accelerator modeling (COMPASS), as well as many other mission-critical applications in DOE and elsewhere. Our recent developments have been focusing on new techniques to overcome scalability bottleneck of direct methods, in both t...
متن کاملEnhancing Linux Scheduler Scalability
This paper examines the scalability of the Linux 2.4.x scheduler as the load and number of CPUs increases. We show that the current scheduler design involving a single runqueue and lock can suffer from lock contention problems which limits its scalability. We present alternate designs using multiple runqueues and priority levels that can reduce lock contention while maintaining the same functio...
متن کاملEnhancing RSVP Scalability
The current resource Reservation Protocol (RSVP) design has no reliability mechanism for the delivery of control messages. Instead, RSVP relies on periodic refresh between routers to maintain reservation states. This approach has several problems in a congested network. End systems send PATH and RESV messages to set up RSVP connections. If the first PATH or RESV message from an end system is ac...
متن کاملParallel Sparse Direct Methods: A short tutorial
A shorter version of this report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific r...
متن کاملSparse Direct Methods for Model Simulation
In this paper, diierent strategies to exploit the sparse structure in the solution techniques for macroeconometric models with forward-looking variables are discussed. First, the stacked model is decomposed into recursive submodels without destroying its original block pattern. Next, we concentrate on how to eeciently solve the sparse linear system in the Newton algorithm. In this frame, a mult...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2007
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/78/1/012041